PSF field learning based on Optimal Transport Distances

نویسندگان

  • Fred Maurice Ngolè Mboula
  • Jean-Luc Starck
چکیده

Abstract. Context: in astronomy, observing large fractions of the sky within a reasonable amount of time implies using large field-of-view (fov) optical instruments that typically have a spatially varying Point Spread Function (PSF). Depending on the scientific goals, galaxies images need to be corrected for the PSF whereas no direct measurement of the PSF is available. Aims: given a set of PSFs observed at random locations, we want to estimate the PSFs at galaxies locations for shapes measurements correction. Contributions: we propose an interpolation framework based on Sliced Optimal Transport. A non-linear dimension reduction is first performed based on local pairwise approximated Wasserstein distances. A low dimensional representation of the unknown PSFs is then estimated, which in turn is used to derive representations of those PSFs in the Wasserstein metric. Finally, the interpolated PSFs are calculated as approximated Wasserstein barycenters. Results: the proposed method was tested on simulated monochromatic PSFs of the Euclid space mission telescope (to be launched in 2020). It achieves a remarkable accuracy in terms of pixels values and shape compared to standard methods such as Inverse Distance Weighting or Radial Basis Function based interpolation methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logistics and pretreatment of forest biomass

In large regions of the world, biomass is a very important source of energy. The global bioenergy market based on forest biomass is growing rapidly. About 92 % of the bioenergy in Sweden comes from forests. Biomass from forests is not homogenous. The locations, transport distances, and transport methods, can differ very much and the industries that need biomass as input prefer raw materials wit...

متن کامل

Multiscale Strategies for Computing Optimal Transport

This paper presents a multiscale approach to efficiently compute approximate optimal transport plans between point sets. It is particularly well-suited for point sets that are in high-dimensions, but are close to being intrinsically low-dimensional. The approach is based on an adaptive multiscale decomposition of the point sets. The multiscale decomposition yields a sequence of optimal transpor...

متن کامل

Ground metric learning

Optimal transport distances have been used for more than a decade in machine learning to compare histograms of features. They have one parameter: the ground metric, which can be any metric between the features themselves. As is the case for all parameterized distances, optimal transport distances can only prove useful in practice when this parameter is carefully chosen. To date, the only option...

متن کامل

Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration

Computing optimal transport distances such as the earth mover’s distance is a fundamental problem in machine learning, statistics, and computer vision. Despite the recent introduction of several algorithms with good empirical performance, it is unknown whether general optimal transport distances can be approximated in near-linear time. This paper demonstrates that this ambitious goal is in fact...

متن کامل

Optimal Synthesis of Cascade Refrigeration in Liquefied Natural Gas Cycles by Pinch-Exergy

Iran’s vast common natural gas resources and the necessity to extract and export it as Liquefied Natural Gas (LNG) to distances more than 3000Km opens a lucrative field for researchers to optimize LNG cycles. In this article heat integration in cryogenic cycles by determining interacycle partition temperature and optimizing refrigeration features like Subcooler, Presaturator, aftercooler, reboi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1703.06066  شماره 

صفحات  -

تاریخ انتشار 2017